Computational Complexity of Sparse Real Algebraic Function Interpolation
نویسندگان
چکیده
We estimate the complexity of a general problem for interpolating real algebraic functions given by a black box for their evaluations, extending the results of [GKS 90b, GKS 91b] on interpolation of sparse rational functions.
منابع مشابه
Mammalian Eye Gene Expression Using Support Vector Regression to Evaluate a Strategy for Detecting Human Eye Disease
Background and purpose: Machine learning is a class of modern and strong tools that can solve many important problems that nowadays humans may be faced with. Support vector regression (SVR) is a way to build a regression model which is an incredible member of the machine learning family. SVR has been proven to be an effective tool in real-value function estimation. As a supervised-learning appr...
متن کاملComputing expensive multivariate functions of fuzzy numbers using sparse grids
Fuzzy arithmetic provides a powerful tool to introduce uncertainty into mathematical models. With Zadeh’s extension principle, one can obtain a fuzzy extension of any objective function. Computing expensive multivariate functions of fuzzy numbers, however, often poses a difficult problem due to non-applicability of common fuzzy arithmetic algorithms, severe overestimation, or very high computat...
متن کاملFast discrete algorithms for sparse Fourier expansions of high dimensional functions
We develop a fast discrete algorithm for computing the sparse Fourier expansion of a function of d dimension. For this purpose, we introduce a sparse multiscale Lagrange interpolation method for the function. Using this interpolation method, we then design a quadrature scheme for evaluating the Fourier coefficients of the sparse Fourier expansion. This leads to a fast discrete algorithm for com...
متن کاملBlock-Based Sparse Integral Histogram with Interpolation
Integral Histogram is widely used among various real-time algorithms due to its computationally efficient facility to compute histograms from an image. However, its advantage is greatly diminished for algorithms requiring only a few histograms since required initialization operation takes up majority of total running time. In this paper we propose a block-based integral histogram that drastical...
متن کاملA Computational Proof of Complexity of Some Restricted Counting Problems
We explore a computational approach to proving the intractability of certain counting problems. These problems can be described in various ways, and they include concrete problems such as counting the number of vertex covers or independent sets for 3regular graphs. The high level principle of our approach is algebraic, which provides sufficient conditions for interpolation to succeed. Another a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005